Interpolation and Beth Definability over the Minimal Logic
نویسنده
چکیده
Extensions of the Johansson minimal logic J are investigated. It is proved that the weak interpolation property WIP is decidable over J. Well-composed logics with the Graig interpolation property CIP, restricted interpolation property IPR and projective Beth property PBP are fully described. It is proved that there are only finitely many well-composed logics with CIP, IPR or PBP; for any well-composed logic PBP is equivalent to IPR, and all the properties CIP, IPR and PBP are decidable on the class of well-composed logics..
منابع مشابه
Interpolation, Definability and Fixed Points in Interpretability Logics
In this article we study interpolation properties for the minimal system of interpretability logic IL. We prove that arrow interpolation holds for IL and that turnstile interpolation and interpolation for the -modality easily follow from this result. Furthermore, these properties are extended to the system ILP. Failure of arrow interpolation for ILW is established by providing an explicit count...
متن کاملLarisa Maksimova INTERPOLATION AND IMPLICIT DEFINABILITY IN EXTENSIONS OF THE PROVABILITY LOGIC ∗
The provability logic GL was in the field of interest of A.V. Kuznetsov, who had also formulated its intuitionistic analog—the intuitionistic provability logic—and investigated these two logics and their extensions. In the present paper, different versions of interpolation and of the Beth property in normal extensions of the provability logic GL are considered. It is proved that in a large clas...
متن کاملInterpolation Properties, Beth Definability Properties and Amalgamation Properties for Substructural Logics
This paper develops a comprehensive study of various types of interpolation properties and Beth definability properties for substructural logics, and their algebraic characterizations through amalgamation properties and epimorphisms surjectivity. In general, substructural logics are algebraizable but lack many of the basic logical properties that modal and superintuitionistic logics enjoy (cf. ...
متن کاملBeth Definability in Institutions
BETH DEFINABILITY IN INSTITUTIONS MARIUS PETRIA∗ AND RĂZVAN DIACONESCU Abstract. This paper studies definability within the theory of institutions, a version of abstract model This paper studies definability within the theory of institutions, a version of abstract model theory that emerged in computing science studies of software specification and semantics. We generalise the concept of definab...
متن کاملOn Interpolation in Existence Logics
In [2] Gentzen calculi for intuitionistic logic extended with an existence predicate were introduced. Such logics were first introduced by Dana Scott, who provided a proof system for it in Hilbert style. The logic seems particularly useful in settings where non constant domain Kripke models play a role. In this paper it is proved that these systems have interpolation and the Beth definability p...
متن کامل